Bat-Inspired Hidden Node Detection Algorithm and Collision Minimization (BIHD-CM) Scheme for IEEE802.11AH
نویسندگان
چکیده
منابع مشابه
A bat-inspired algorithm for structural optimization
Bat-inspired (BI) search is a recently developed numerical optimization technique that makes use of echolocation behavior of bats in seeking a design space. This study intends to explore capabilities and potentials of this newly developed method in the realm of structural optimization. A novel algorithm is developed that employs basic principles of this method for structural optimization proble...
متن کاملA New Metaheuristic Bat-Inspired Algorithm
Metaheuristic algorithms such as particle swarm optimization, firefly algorithm and harmony search are now becoming powerful methods for solving many tough optimization problems. In this paper, we propose a new metaheuristic method, the Bat Algorithm, based on the echolocation behaviour of bats. We also intend to combine the advantages of existing algorithms into the new bat algorithm. After a ...
متن کاملBat inspired algorithm for discrete size optimization of steel frames
Bat inspired (BI) algorithm is a recently developed metaheuristic optimization technique inspired by echolocation behavior of bats. In this study, the BI algorithm is examined in the context of discrete size optimization of steel frames designed for minimum weight. In the optimum design problem frame members are selected from available set of steel sections for producing practically acceptable ...
متن کاملOptimization of neural network model using modified bat-inspired algorithm
The success of an artificial neural network (ANN) strongly depends on the variety of the connection weights and the network structure. Among many methods used in the literature to accurately select the network weights or structure in isolate; a few researchers have attempted to select both the weights and structure of ANN automatically by using metaheuristic algorithms. This paper proposes modi...
متن کاملA New Node Centroid Algorithm for Bandwidth Minimization
Singapore Management University, 469 Buki t T imah Road Singapore 259756 [email protected] Fei X iao School of Comput ing National University of Singapore 3 Science Drive 2 Singapore 117543 [email protected] We propose a Node Centroid method with Hil lClimbing to solve the well-known matrix bandwidth minimization problem, which is to permute rows and columns of the matrix to minimize its band...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computing & Network Technology
سال: 2018
ISSN: 2210-1519
DOI: 10.12785/ijcnt/060305